Elitism, Sharing, and Ranking Choices in Evolutionary Multi-criterion Optimisation
نویسندگان
چکیده
Elitism and sharing are two mechanisms that are believed to improve the performance of an evolutionary multi-criterion optimiser. The relative performance of the two most popular ranking strategies is largely unknown. Using a new empirical inquiry framework, this report studies the effect of elitism, sharing, and ranking design choices using a benchmark suite of two-criterion problems. Performance is assessed, via known metrics, in terms of both closeness to the true Pareto-optimal front and diversity across the front. Randomisation methods are employed to determine significant differences in performance. Informative visualisation of results is achieved using the attainment surface concept. Elitism is found to offer a consistent improvement in terms of both closeness and diversity, thus confirming results from other studies. Sharing can be beneficial, but can also prove surprisingly ineffective. Evidence presented herein suggests that parameter-less schemes are more robust than their parameter-based equivalents (including those with automatic tuning). Very little performance difference is evident between the two ranking strategies. A multi-objective genetic algorithm combining both elitism and parameter-less sharing is shown to offer very good performance across the test suite.
منابع مشابه
Why Use Elitism And Sharing In A Multi-objective Genetic Algorithm?
Elitism and sharing are two mechanisms that are believed to improve the performance of a multiobjective evolutionary algorithm (MOEA). Using a new empirical inquiry framework, this paper studies the effect of elitism and sharing design choices using a benchmark suite of two-criterion problems. Performance is assessed, via known metrics, in terms of both closeness to the true Pareto-optimal fron...
متن کاملA Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II
Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(mN3) computational complexity (where m is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algo...
متن کاملNon-dominated Ranked Genetic Algorithm for Solving Multi-objective Optimization Problems: Nrga
Multi-objective evolutionary algorithms (EAs) that use non-dominated sorting and sharing have been criticized. Mainly for their: 1) ( 3 MN O computational complexity (where M is the number of objectives and N is the population size). 2Non-elitism approach; 3-the need for specifying a sharing parameter. In this paper, a method combining the new Ranked based Roulette Wheel selection algorithm wit...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملA Unified Model for Multi-Objective Evolutionary Algorithms with Elitism
Though it has been claimed that elitism could improve evolutionary multi-objective search significantly, a thorough and extensive evaluation of its effects is still missing. Guidelines on how elitism could successfully be incorporated have not yet been developed. This paper presents a unified model of multi-objective evolutionary algorithms, in which arbitrary variation and selection operators ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002